Rewrite Rules and Simpliication of Matrix Expressions
نویسنده
چکیده
This paper concerns the automated simpliication of expressions which involve non-commuting variables. The technology has been applied to the simpliication of matrix and operator theory expressions which arise in engineering applications. The non-commutative variant of the Grr obner Basis Algorithm is used to generate rewrite rules. We will also look at the phenomenon of innnite bases and implications for automated theorem proving.
منابع مشابه
Rewrite Rules and Simplification of Matrix Expressions
This paper concerns the automated simplification of expressions which involve non-commuting variables. The technology has been applied to the simplification of matrix and operator theory expressions which arise in engineering applications. The non-commutative variant of the Gröbner Basis Algorithm is used to generate rewrite rules. We will also look at the phenomenon of infinite bases and impli...
متن کاملJoin Evaluation Schemata for Constraint Handling Rules (chr)
CHR is a committed-choice language consisting of guarded rules that rewrite constraints into simpler ones until they are solved. CHR can de-ne both simpliication of and propagation over user-deened constraints. Simpliication replaces constraints by simpler constraints while preserving logical equivalence. Propagation adds new constraints which are logically redundant but may cause further simpl...
متن کاملA Complex Example of a Simplifying Rewrite System
For a string rewriting system, it is known that termination by a simpliication ordering implies multiple recursive complexity. This theoretical upper bound is, however, far from having been reached by known examples of rewrite systems. All known methods used to establish termination by simpliication yield a primitive recursive bound. Furthermore, the study of the order types of simpliication or...
متن کاملLazy Uniication with Simpliication
Uniication in the presence of an equational theory is an important problem in theorem-proving and in the integration of functional and logic programming languages. This paper presents an improvement of the proposed lazy uniication methods by incorporating simpliication into the uniication process. Since simpliication is a deterministic computation process, more eecient uniication algorithms can...
متن کاملPreserving Confluence for Rewrite Systems with Built-in Operations
We consider combinations of term rewriting with built-in operations which compute objects of some external domain from ground terms. Combining a canonical term rewriting system with a computation relation does in general not lead to a canonical simpliication relation. We show how a canonical simpliication system can be constructed for such rewrite systems with built-in operations. Decomposition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996